Instantons, Poisson structures and generalized Kähler geometry
نویسنده
چکیده
Using the idea of a generalized Kähler structure, we construct bihermitian metrics on CP2 and CP1×CP1, and show that any such structure on a compact 4-manifold M defines one on the moduli space of anti-self-dual connections on a fixed principal bundle over M . We highlight the role of holomorphic Poisson structures in all these constructions.
منابع مشابه
Symmetries in Generalized Kähler Geometry
We define the notion of amomentmap and reduction in both generalized complex geometry and generalized Kähler geometry. As an application, we give very simple explicit constructions of bi-Hermitian structures on CP , Hirzebruch surfaces, the blow up of CP at arbitrarily many points, and other toric varieties, as well as complex Grassmannians.
متن کاملMirror symmetry for topological sigma models with generalized Kähler geometry
We consider topological sigma models with generalized Kähler target spaces. The mirror map is constructed explicitly for a special class of target spaces and the topological A and B model are shown to be mirror pairs in the sense that the observables, the instantons and the anomalies are mapped to each other. We also apply the construction to open topological models and show that A branes are m...
متن کاملGeneralized Complex Geometry and the Poisson Sigma Model
The supersymmetric Poisson Sigma model is studied as a possible worldsheet realization of generalized complex geometry. Generalized complex structures alone do not guarantee non-manifest N = (2, 1) or N = (2, 2) supersymmetry, but a certain relation among the different Poisson structures is needed. Moreover, important relations of an additional almost complex structure are found, which have no ...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008